2d Shape Optimization Via Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Airfoil Shape Optimization with Adaptive Mutation Genetic Algorithm
An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...
متن کاملA Genetic Algorithm based Optimization Method in 3D Solid Reconstruction from 2D Multi-View Engineering Drawings
There are mainly two categories for a 3D reconstruction from 2D drawings: B-Rep and CSG that both these methods have serious weaknesses despite being useful. B-Rep method which has been older and have wider function range is problematic because of high volume of calculations and vagueness in answers and CSG method has problem in terms of very limited range of volumes and drawings that it can an...
متن کاملOptimization of Freeform Building Shape Using Genetic Algorithm
This paper proposes an optimization algorithm for envelope design during an early stage freeform building design. This study performs geometric modeling using a three-dimensional (3D) design tool called Rhino, which designs examples of freeform buildings with a parametric design method, i.e., a 3D design technique for freeform building design. This method proceeds by mesh generation for the fre...
متن کاملISOGEOMETRIC STRUCTURAL SHAPE OPTIMIZATION USING PARTICLE SWARM ALGORITHM
One primary problem in shape optimization of structures is making a robust link between design model (geometric description) and analysis model. This paper investigates the potential of Isogeometric Analysis (IGA) for solving this problem. The generic framework of shape optimization of structures is presented based on Isogeometric analysis. By discretization of domain via NURBS functions, the a...
متن کاملBlack Box Optimization via a Bayesian-Optimized Genetic Algorithm
We present a simple and robust optimization algorithm, related to genetic algorithms and with analogies to the popular CMA–ES search algorithm, that serves as a cheap alternative to Bayesian Optimization. The algorithm is robust against both monotonic transforms of the objective function value and affine transformations of the feasible region. It is fast and easy to implement, and has performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Computer Science
سال: 2014
ISSN: 2008-949X
DOI: 10.22436/jmcs.011.03.04